Computing sampling points in a semi-algebraic set defined by non-strict inequalities, application to Pattern-Matching Problems
نویسندگان
چکیده
We focus on the problem of computing sampling points in a semi-algebraic set defined by equations and non-strict inequalities. This problem is reduced to computing sampling points in several real algebraic varieties, represent these points by rational parametrizations and decide the sign of some polynomials at the real solutions of these parametrizations. We show how these tasks can be deduced from existing algorithms and proceed to a complexity analysis. Then, we study a pattern-matching problems and show how our implementation can solve some instances of these problems.
منابع مشابه
On the practical computation of one point in each connected component of a semi-algebraic set defined by a polynomial system of equations and non-strict inequalities
Given polynomials f1, . . . , fk, g1, . . . , gs inQ[X1, . . . , Xn], we consider the semi-algebraic set S defined by: f1 = . . . = fk = 0 g1 ≥ 0, . . . , gs ≥ 0 and focus on the problem of computing at least one point in each connected component of S. We first study how to solve this problem by considering S as the union of solutions sets of polynomial systems of equations and strict inequalit...
متن کاملReal Spectrum and the Abstract Positivstellensatz
Algebraic geometry emerged from the study of subsets of C defined by polynomial equations, namely algebraic sets. Parallel to this, real algebraic geometry emerged from studying subsets of R defined by polynomial equations and inequalities, namely semi-algebraic sets. Like algebraic geometry, classical methods in real algebraic geometry provided useful but limited intuition on the relationship ...
متن کاملRamsey-type results for semi-algebraic relations Citation
A k-ary semi-algebraic relation E on R is a subset of R, the set of k-tuples of points in R , which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at most t if the number of polynomials and their degrees are all bounded by t. A set A ⊂ R is called homogeneous if all or none of the k-tuples from A s...
متن کاملStrong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کاملComputing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time
For any l > 0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P1 ≤ 0, . . . , Ps ≤ 0, where each Pi ∈ R[X1, . . . ,Xk ] has degree ≤ 2, and computes the top l Betti numbers of S, bk−1(S), . . . , bk−l(S), in polynomial time. The complexity of the algorithm, stated more precisely, is ∑l+2 i=0 ( s i ) k2 O(min(l,s)) . For fixed l, the complexity of the algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004